on certain semigroups of transformations that preserve double direction equivalence
Authors
abstract
let tx be the full transformation semigroups on the set x. for an equivalence e on x, let te(x) = {α ∈ tx : ∀(x, y) ∈ e ⇔ (xα, yα) ∈ e}it is known that te(x) is a subsemigroup of tx. in this paper, we discussthe green's *-relations, certain *-ideal and certain rees quotient semigroup for te(x).
similar resources
On certain semigroups of transformations that preserve double direction equivalence
Let TX be the full transformation semigroups on the set X. For an equivalence E on X, let TE(X) = {α ∈ TX : ∀(x, y) ∈ E ⇔ (xα, yα) ∈ E}It is known that TE(X) is a subsemigroup of TX. In this paper, we discussthe Green's *-relations, certain *-ideal and certain Rees quotient semigroup for TE(X).
full textCoverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the route followed by incoming messages. We prove that (weak) sense of direction is preserved by the construction of regular coverings (i.e., coverings induced by voltage assignments in a group) whose voltage assignment depe...
full textOn Transformations of Interactive Proofs that Preserve the Prover's Complexity
Goldwasser and Sipser [GS89] proved that every interactive proof system can be transformed into a public-coin one (a.k.a., an Arthur–Merlin game). Their transformation has the drawback that the computational complexity of the prover’s strategy is not preserved. We show that this is inherent, by proving that the same must be true of any transformation which only uses the original prover and veri...
full textEquivalence Transformations on Statecharts
Statecharts are a popular representation technique for conceptual models of the dynamics of a universe of discourse. However, designers are not supported in their work with dynamic models as well as they are for working with static models. We present a meta-model and a formalization of the semantics of a statechart language. Important results are the definition of the equivalence of statecharts...
full textFUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS
In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyجلد ۴۲، شماره ۴، صفحات ۱۰۱۵-۱۰۲۴
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023